Relatively computably enumerable reals
نویسندگان
چکیده
منابع مشابه
Presentations of computably enumerable reals
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
متن کاملRelatively recursively enumerable reals
We say that a real X is relatively r.e. if there exists a real Y such that X is r.e. (Y ) and X 6≤T Y . We say X is relatively REA if there exists such a Y ≤T X. We define A ≤e1 B if there exists a Σ1 set C such that n ∈ A if and only if there is a finite E ⊆ B with (n, E) ∈ C. In this paper we show that a real X is relatively r.e. if and only if X 6≤e1 X. We prove that every nonempty Π01 class...
متن کاملComputably Enumerable Reals and Uniformly Presentable Ideals
We study the relationship between a computably enumerable real and its presentations. A set A presents a computably enumerable real α if A is a computably enumerable prefix-free set of strings such that α = ∑ σ∈A 2 −|σ|. Note that ∑ σ∈A 2 −|σ| is precisely the measure of the set of reals that have a string in A as an initial segment. So we will simply abbreviate ∑ σ∈A 2 −|σ| by μ(A). It is know...
متن کاملDegree-Theoretic Aspects of Computably Enumerable Reals
A real is computable if its left cut, L( ); is computable. If (qi)i is a computable sequence of rationals computably converging to ; then fqig; the corresponding set, is always computable. A computably enumerable (c.e.) real is a real which is the limit of an increasing computable sequence of rationals, and has a left cut which is c.e. We study the Turing degrees of representations of c.e. real...
متن کاملA Note on the Differences of Computably Enumerable Reals
We show that given any non-computable left-c.e. real α there exists a left-c.e. real β such that α , β + γ for all left-c.e. reals and all right-c.e. reals γ. The proof is non-uniform, the dichotomy being whether the given real α is Martin-Löf random or not. It follows that given any universal machine U, there is another universal machine V such that the halting probability ΩU of U is not a tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2010
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-010-0219-2